A Statistical Mechanics Approach to Random Euclidean MAX TSP

نویسندگان

  • David S. Dean
  • David Lancaster
  • Satya N. Majumdar
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic analysis of the Traveling Salesman Problem to appear as a chapter in a forthcoming book on the TSP

In this chapter we study the Hamiltonian cycle and Traveling Salesman problem from a probabilistic point of view. Here we try to elucidate the properties of typical rather than worst-case examples. Structurally, one hopes to bring out the surprising properties of typical instances. Algorithmically the hope is that one can in some way explain the successful solution of large problems, much large...

متن کامل

Hierarchical Approach in Clustering to Euclidean Traveling Salesman Problem

There has heen growing interest in studying cO l11binatorinl optimiza­ tion problems by clustering strategy. with a special emphasis on the tra veling sa lesman problem (TSP). TSP naturally arises as a sub problem in much trans­ portation. manufacturing and logistics application. thi s problem has caught much attention of mathemati cians and computer scienti sts. A cluster ing ap­ proach will d...

متن کامل

Scalefree hardness of average-case Euclidean TSP approximation

We show that if P 6= NP, then a wide class of TSP heuristics fail to approximate the length of the TSP to asymptotic optimality, even for random Euclidean instances. As an application, we show that when using a heuristic from this class, a natural class of branch-and-bound algorithms takes exponential time to find an optimal tour (again, even on a random point-set), regardless of the particular...

متن کامل

Generating subtour constraints for the TSP from pure integer solutions

The traveling salesman problem (TSP) is one of the most prominent combinatorial optimization problems. Given a complete graph G = (V, E) and non-negative distances d for every edge, the TSP asks for a shortest tour through all vertices with respect to the distances d. The method of choice for solving the TSP to optimality is a branch-and-bound-and-cut approach. Usually the integrality constrain...

متن کامل

Perspectives in Lattice Gravity

We briefly overview the development of Euclidean quantum gravity in four dimensions regarded as a branch of statistical mechanics of discretized random manifolds.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006